Cycle double covers of graphs with Hamilton paths
نویسندگان
چکیده
منابع مشابه
6-cycle Double Covers of Cubic Graphs
A cycle double cover (CDC) of an undirected graph is a collection of the graph’s cycles such that every edge of the graph belongs to exactly two cycles. We describe a constructive method for generating all the cubic graphs that have a 6-CDC (a CDC in which every cycle has length 6). As an application of the method, we prove that all such graphs have a Hamiltonian cycle. A sense of direction is ...
متن کاملCycle Double Covers of Graphs with Disconnected Frames
Continuing work initiated by Häggkvist and Markström, we show in this paper that certain disconnected frames guarantee the existence of a cycle double cover. Specifically, we show that the disjoint union of a Kotzig and a sturdy graph forms a good frame.
متن کاملClasses of line graphs with small cycle double covers
The Small Cycle Double Cover Conjectnre, due to J .A. Bondy, states that every simple bridgeless graph on n vertices has a cycle double cover with at most (n 1) cycles. There are a number of classes of graphs for which this conjecture is known to hold; for example, triangulations of surfaces, complete graphs, and 4-connected planar graphs. In this article, we prove that the conjecture holds for...
متن کاملMore orthogonal double covers of complete graphs by Hamiltonian paths
An orthogonal double cover (ODC) of the complete graph Kn by a graph G is a collection G of n spanning subgraphs of Kn, all isomorphic toG, such that any two members ofG share exactly one edge and every edge ofKn is contained in exactly two members of G. In the 1980s Hering posed the problem to decide the existence of an ODC for the case that G is an almost-Hamiltonian cycle, i.e. a cycle of le...
متن کاملConstruction of Cycle Double Covers for certain classes of graphs
We introduce two classes of graphs, Indonesian graphs and k-doughnut graphs. Cycle double covers are constructed for these classes. In case of doughnut graphs this is done for the values k = 1, 2, 3 and 4.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1989
ISSN: 0095-8956
DOI: 10.1016/0095-8956(89)90048-8